The $\mathcal{E}$-Average Common Submatrix: Approximate Searching in a Restricted Neighborhood
نویسندگان
چکیده
This paper introduces a new (dis)similarity measure for 2D arrays, extending the Average Common Submatrix measure. This is accomplished by: (i) considering the frequency of matching patterns, (ii) restricting the pattern matching to a fixed-size neighborhood, and (iii) computing a distance-based approximate matching. This will achieve better performances with low execution time and larger information retrieval.
منابع مشابه
On the Remarkable Formula for Spectral Distance of Block Southeast Submatrix
This paper presents a remarkable formula for spectral distance of a given block normal matrix $G_{D_0} = begin{pmatrix} A & B \ C & D_0 end{pmatrix} $ to set of block normal matrix $G_{D}$ (as same as $G_{D_0}$ except block $D$ which is replaced by block $D_0$), in which $A in mathbb{C}^{ntimes n}$ is invertible, $ B in mathbb{C}^{ntimes m}, C in mathbb{C}^{mti...
متن کاملInvestigation of physical resilience of suburban housing against natural hazards (Case study: Bahonar town of Mashhad)
Background and objective: Today, most cities and residential communities are built in places that are exposed to a variety of disasters, such as natural and man-made hazards. Therefore, paying attention to the physical dimensions of residential structures in suburban areas has become very important. The study area is Bahonar town of Mashhad, which is a separate area from district 6 with a popul...
متن کاملApproximate $n-$ideal amenability of module extension Banach algebras
Let $mathcal{A}$ be a Banach algebra and $X$ be a Banach $mathcal{A}-$bimodule. We study the notion of approximate $n-$ideal amenability for module extension Banach algebras $mathcal{A}oplus X$. First, we describe the structure of ideals of this kind of algebras and we present the necessary and sufficient conditions for a module extension Banach algebra to be approximately n-ideally amenable.
متن کاملAn Improved Junction-Based Directional Routing Protocol (IJDRP) for VANETs
Vehicular Ad-Hoc Networks (VANETs) is a novel technology that has recently emerged and due to its swift changing topology and high mobility nature, it has become problematic to design an efficient routing protocol in VANETs’ amongst both moving and stationary units. Also, the existing routing algorithms are not very effective to satisfy all requirements of VANETs. This paper explores the need o...
متن کاملCharacteristics of Common Neighborhood Graph under Graph Operations and on Cayley Graphs
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.06026 شماره
صفحات -
تاریخ انتشار 2017